The Multiterminal Source Coding Problem for Spatial Waves

نویسندگان

  • Sergio D. Servetto
  • Joseph M. Rosenblatt
چکیده

We study a problem of data compression for spatial waves. This is a new multiterminal source coding problem, in which the objects to be represented by a network of encoders are solutions of a partial differential equation. In this paper we formulate the problem, and discuss some intial results towards the determination of the rate-distortion region for waves.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiterminal Source Coding with Two Encoders--I: A Computable Outer Bound

In this first part, a computable outer bound is proved for the multiterminal source coding problem, for a setup with two encoders, discrete memoryless sources, and bounded distortion measures.

متن کامل

Universal source coding for complementary delivery

This paper deals with a universal coding problem for a certain kind of multiterminal source coding system that we call the complementary delivery coding system. Both fixed-to-fixed length and fixed-to-variable length lossless coding schemes are considered. Explicit constructions of universal codes and bounds of the error probabilities are clarified via type-theoretical and graph-theoretical ana...

متن کامل

An Information-Spectrum Approach to Multiterminal Rate-Distortion Theory

An information-spectrum approach is applied to solve the multiterminal source coding problem for correlated general sources, where sources may be nonstationary and/or nonergodic, and the distortion measure is arbitrary and may be nonadditive. A general formula for the rate-distortion region of the multiterminal source coding problem with the maximum distortion criterion under fixed-length codin...

متن کامل

An Infeasibility Result for the Multiterminal Source-Coding Problem

We prove a new outer bound on the rate-distortion region for the multiterminal source-coding problem. This bound subsumes the best outer bound in the literature and improves upon it strictly in some cases. The improved bound enables us to obtain a new, conclusive result for the binary erasure version of the “CEO problem.” The bound recovers many of the converse results that have been establishe...

متن کامل

Distributed Source Coding of Correlated Gaussian Sources

We consider the distributed source coding system of L correlated Gaussian sources Yl, l = 1, 2, · · · , L which are noisy observations of correlated Gaussian remote sources Xk, k = 1, 2, · · · ,K. We assume that Y L = (Y1, Y2, · · · , YL) is an observation of the source vector X = (X1, X2, · · · , XK), having the form Y L = AX+N, where A is a L×K matrix and N = (N1, N2, · · · , NL) is a vector ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006